50 research outputs found

    Erratum to ā€œInteger Codes Correcting Burst and Random Asymmetric Errors within a Byteā€ [J. Franklin Inst. 355 (2018) 981ā€“996] (S0016003218302722) (10.1016/j.jfranklin.2018.04.034))

    Get PDF
    An equation appearing on page 992 of the article is incorrect. The incorrect equation appearing thus: [Formula presented] Should in fact appear thus: [Formula presented] Also, a sentence appearing on page 922 is incorrect. The following statement: [Formula presented] Should read thus: ā€¦one code with code rate 0.9922 has theoretical throughput above 32 Gbps. Thus, it could be candidate for use in ONWOAs operating at 32 Gbps (e.g. 32G Fibre Channel network). Ā© 2018The contribution corrects an equation from the paper: Maharajan, C., Raja, R., Cao, J., Rajchakit, G., 2018. Novel global robust exponential stability criterion for uncertain inertial-type BAM neural networks with discrete and distributed time-varying delays via Lagrange sense. Journal of the Franklin Institute 355, 4727ā€“4754. [https://doi.org/10.1016/j.jfranklin.2018.04.034

    Integer Codes Correcting Spotty Byte Asymmetric Errors

    Get PDF
    In short-range optical networks, channel errors occur due to energy losses. Upon transmission, they mostly manifest themselves as spotty byte asymmetric errors. In this letter, we present a class of codes that can correct these errors. The presented codes use integer and lookup table operations, which make them suitable for software implementation. In addition, if needed, the proposed codes can be interleaved without delay and without using any additional hardware

    Integer Codes Correcting High-Density Byte Asymmetric Errors

    Get PDF
    In optical networks without optical amplifiers, the number of received photons never exceeds the number of sent ones. Hence, upon transmission, only asymmetric (1 ā†’ 0) errors can occur. Motivated by this fact, in this letter, we present a class of integer codes capable of correcting high-density asymmetric errors within a b-bit byte. Unlike classical codes, these codes use integer and lookup table operations. As a result, they can be implemented ā€œfor free,ā€ i.e., without modifying the network hardware.This is the peer-reviewed manuscript of the article: Radonjic, A., Vujicic, V., 2017. Integer Codes Correcting High-Density Byte Asymmetric Errors. IEEE Communications Letters 21, 694ā€“697. [https://doi.org/10.1109/LCOMM.2016.2644661

    Logarithmic time encoding and decoding of integer error control codes

    Get PDF
    One of the most important characteristics of all error control codes (ECCs) is the complexity of the encoding/decoding algorithms. Today, there are many ECCs that can correct multiple bit errors, but at the price of high encoding/decoding complexity. Among the rare exceptions are integer ECCs (IECCs), whose serial encoding/decoding algorithms run in O(n) time, where n is the codeword length. In this article, we show that IECCs can be encoded/decoded even faster, that is, that their parallel encoding/decoding algorithms have O(log2n) time complexity

    Integer Codes Correcting Burst Asymmetric Errors Within a Byte

    Get PDF
    This paper presents two types of integer codes capable of correcting burst asymmetric errors within a byte. The presented codes are constructed with the help of a computer and are very efficient in terms of redundancy. The results of a computer search have shown that, for practical data lengths up to 4096 bits, the presented codes use up to two check-bits less than the best burst asymmetric error correcting codes. Besides this, it is shown that the presented codes are suitable for implementation on modern processors

    Integer codes correcting burst asymmetric within a byte and double asymmetric errors

    Get PDF
    This paper presents a class of integer codes capable of correcting l-bit burst asymmetric errors within a b-bit byte (1 ā‰¤ l < b) and double asymmetric errors within a codeword. The presented codes are constructed with the help of a computer and have the potential to be used in unamplified optical networks. In addition, the paper derives the upper bound on code length and shows that the proposed codes are efficient in terms of redundancy.This is the peer reviewed version of the following article: Radonjic, A., Vujicic, V., 2019. Integer codes correcting burst asymmetric within a byte and double asymmetric errors. Cryptogr. Commun. [https://doi.org/10.1007/s12095-019-00388-0]The original version of this article unfortunately contained a mistake in the main title. Instead of ā€œInteger codes correcting burst asymmetric within a byte and double asymmetric errorsā€ the title should read ā€œInteger codes correcting burst asymmetric errors within a byte and double asymmetric errorsā€. The correction: [https://doi.org/10.1007/s12095-019-00398-y]Published version: [https://hdl.handle.net/21.15107/rcub_dais_10030

    Stochastic embedded systems

    Get PDF
    Computing, analog-to-digital conversion and digital-to-analog conversion are the three most important functions in embedded systems. The last two may include stochasticity regardless of whether the computing is stochastic or not. The purpose of this paper is to specify and clarify the role of stochasticity in embedded systems

    Naturally weighted measurement data in power grid ā€“ measurement data in Fourier domain

    Get PDF
    The latest development of stochastic digital measurement method allows extremely simple measurement of Fourier coefficients and, thus, the harmonic amplitudes: the natural weights of the measurement data in Fourier domain. The significance of each measurement data is defined by its weight, which allows the optimization of data recording, data analysis and artificial neural network training in a power grid

    Competitiveness and Development of National Economy

    Get PDF
    This paper examines the relation between the two, may be the most pressing, phenomena of the world economy: competitiveness and development. Of course both can be interpreted in several ways, but the most operative way is to consider competitivenes by the methodology of the World Economic Forum's Global Competitiveness Index, and the development by the gross of domestic product per population. The intent is to determine what is the conection between these two indicators in general, and to pass the question in such a way, and to establish a methodology for further analysis of individual groups of countries considered in the report of the World Economic Forum's Global Competitiveness in the world. Therefore, we use correlation analysis between the observed indicators for the economy after 2005, since the above-mentioned study and implement competitiveness, with an accent on the last mid-term because of current events. The answer to the question: what is the relationship between these indicators in the timeline for all countries concerned is excpected. It is also important for the countries of the former Yugoslavia as a guide in the efforts to retrieve the position in the world economy

    Idejni projekat generatora analognog diskretnog uniformnog Ŕuma

    Get PDF
    U radu ce predlaže ideja generatora analognog diskretnog uniformnog Ŕuma (GADUŠ) za primenu u stohastičkoj digitalnoj mernoj metodi. Predloženim reŔenjem, za razliku od standardnog, koje koristi generator slučajnih brojeva i precizni i tačni digitalno-analogni konvertor (DAK), se prevazilazi problem ograničene rezolucije DAK-a i njegov uzak propusni opseg
    corecore